package com.caochenlei.tree.bst;

public class BinarySearchTreeTest {
    public static void main(String[] args) {
        BinarySearchTree<String, String> tree = new BinarySearchTree<>();
        tree.put("E", "E");
        tree.put("B", "B");
        tree.put("G", "G");
        tree.put("A", "A");
        tree.put("D", "D");
        tree.put("F", "F");
        tree.put("H", "H");
        tree.put("C", "C");
        tree.midErgodic();
    }
}
